Reversible Codes and Applications to DNA

نویسندگان

  • Elif Segah Oztas
  • Irfan Siap
  • Bahattin Yildiz
چکیده

The importance of DNA for living creatures is a very well known fact. Furthermore, the rich structure and knowing the role of the structure of DNA has led the researchers to the direction where the structure of DNA can be realized in computing processes and computer related technologies. Recent studies show that DNA can storage data as a big digital memory and can be a good tool for error correction besides other applications. Both the form reverse and reversible-complement are well known properties of DNA. These two important properties that DNA enjoys are considered in the sets or in more narrow but practical sense in linear spaces. The algebraic structures of such spaces are then studied. The algebraic structures (linear subspaces, submodules) that enjoy these properties are called DNA codes. There have been studies on DNA codes that correspond to singleton or double DNA letter representations. The main goal in each study was to construct a linear code (or cyclic code) that enjoy the DNA properties. In this work, we define a new family of polynomials called coterm polynomials. By taking advantage of this family, we are able to find reversible and reversible-complement codes by using coterm polynomials that are not necessarily linear cyclic codes over commutative rings. Furthermore, optimal codes over some finite fields obtained by the coterm polynomials are constructed. Moreover, we identify k-bases of DNA with elements in the ring R2k = F2[u]/(u−1). We are able to address the reversibility and complement problems in DNA codes over this ring. We define new rules that matches DNA bases and elements of the ring. Accordingly, we introduce a generating method suitable for obtaining DNA codes. With a freedom on the choice of k we are able to embed any DNA code in a suitable ring, giving an algebraic structure to the DNA codes. In order to illustrate the theoretical findings we have written some algorithms and programs in MAGMA and Mathematica softwares. The programs generate and control this DNA codes. Acknowledgement: This study is supported by The Scientific and Technological Research Council of Turkey (TÜBİTAK) (No: 113F071). *Department of Mathematics, Yildiz Technical University, Istanbul, TURKEY, email:[email protected], [email protected] 1Department of Mathematics, Fatih University, Istanbul, TURKEY, e-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On DNA codes from a family of chain rings∗

In this work, we focus on reversible cyclic codes which correspond to reversible DNA codes or reversible-complement DNA codes over a family of finite chain rings, in an effort to extend what was done by Yildiz and Siap in [20]. The ring family that we have considered are of size 2 k , k = 1, 2, · · · and we match each ring element with a DNA 2k−1-mer. We use the so-called u-adic digit system to...

متن کامل

Reversible Logic Multipliers: Novel Low-cost Parity-Preserving Designs

Reversible logic is one of the new paradigms for power optimization that can be used instead of the current circuits. Moreover, the fault-tolerance capability in the form of error detection or error correction is a vital aspect for current processing systems. In this paper, as the multiplication is an important operation in computing systems, some novel reversible multiplier designs are propose...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

Evolutionary QCA Fault-Tolerant Reversible Full Adder

Today, the use of CMOS technology for the manufacture of electronic ICs has faced many limitations. Many alternatives to CMOS technology are offered and made every day. Quantum-dot cellular automata (QCA) is one of the most widely used. QCA gates and circuits have many advantages including small size, low power consumption and high speed. On the other hand, using special digital gates called re...

متن کامل

Reverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages

Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014